The complete factorization of $2^{132}+1$

P3-factorization of complete bipartite symmetric digraphs

In path factorization, H. Wang [1] gives the necessary and sufficient conditions for the existence of P_k-factorization of a complete bipartite graph for k, an even integer. Further, Beiling Du [2] extended the work of H. Wang, and studied the P_2k-factorization of complete bipartite multigraph. For odd value of k the work on factorization was done by a number of researchers. P_3-factorization ...

P 9 - Factorization of Complete Bipartite Graph

Pk -factorization of a complete bipartite graph for k, an even integer was studied by H. Wang [1]. Further, Beiling Du [2] extended the work of H.Wang, and studied the P2k-factorization of complete bipartite multigraph. For odd value of k the work on factorization was done by a number of researchers[3,4,5]. P3-factorization of complete bipartite graph was studied by K.Ushio [3]. P5-factorizatio...

K1, pq-factorization of complete bipartite graphs

Let Km,n be a complete bipartite graph with two partite sets having m and n vertices, respectively. A K1,k-factorization of Km,n is a set of edge-disjoint K1,k-factors of Km,n which partition the set of edges of Km,n. When k is a prime number p, Wang [Discrete Math. 126 (1994)] investigated the K1,p-factorization of Km,n and gave a sufficient condition for such a factorization to exist. Du [Dis...

P7-factorization of complete bipartite graphs

P2k-factorization of complete bipartite multigraphs

We show that a necessary and sufficient condition for the existence of a P2k-factorization of the complete bipartitemultigraph )"Km,n is m = n == 0 (mod k(2k l)/d), where d = gcd()", 2k 1).